DETEKSI KEMIRIPAN SOURCE CODE DENGAN METODE FINGERPRINT BASED DISTANCE DAN LEVENSHTEIN DISTANCE
نویسندگان
چکیده
منابع مشابه
Klasifikasi Data Cardiotocography Dengan Integrasi Metode Neural Network Dan Particle Swarm Optimization
Backpropagation (BP) adalah sebuah metode yang digunakan dalam training Neural Network (NN) untuk menentukan parameter bobot yang sesuai. Proses penentuan parameter bobot dengan menggunakan metode backpropagation sangat dipengaruhi oleh pemilihan nilai learning rate (LR)-nya. Penggunaan nilai learning rate yang kurang optimal berdampak pada waktu komputasi yang lama atau akurasi klasifikasi yan...
متن کاملApproximate Periods with Levenshtein Distance
We present a new algorithm deciding for strings t and w whether w is an approximate generator of t with Levenshtein distance at most k. The algorithm is based on finite state transducers.
متن کاملCalculating Reuse Distance from Source Code
The efficient use of a system is of paramount importance in high-performance computing. Applications need to be engineered for future systems even before the architecture of such a system is clearly known. Static performance analysis that generates performance bounds is one way to approach the task of understanding application behavior. Performance bounds provide an upper limit on the performan...
متن کاملStatistical Analysis in Signature Recognition System Based on Levenshtein Distance
The study being presented is a continuation of the previous studies that consisted in the adaptation and use of the Levenshtein method in a signature recognition process. Three methods based on the normalized Levenshtein measure were taken into consideration. The studies included an analysis and selection of appropriate signature features, on the basis of which the authenticity of a signature w...
متن کاملOne-Gapped q-Gram Filtersfor Levenshtein Distance
We have recently shown that q-gram filters based on gapped q-grams instead of the usual contiguous q-grams can provide orders of magnitude faster and/or more efficient filtering for the Hamming distance. In this paper, we extend the results for the Levenshtein distance, which is more problematic for gapped q-grams because an insertion or deletion in a gap affects a q-gram while a replacement do...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computatio : Journal of Computer Science and Information Systems
سال: 2018
ISSN: 2549-2829,2549-2810
DOI: 10.24912/computatio.v2i1.1478